全文获取类型
收费全文 | 2410篇 |
免费 | 134篇 |
国内免费 | 93篇 |
专业分类
化学 | 430篇 |
晶体学 | 4篇 |
力学 | 73篇 |
综合类 | 37篇 |
数学 | 1594篇 |
物理学 | 499篇 |
出版年
2023年 | 13篇 |
2022年 | 46篇 |
2021年 | 46篇 |
2020年 | 46篇 |
2019年 | 31篇 |
2018年 | 38篇 |
2017年 | 48篇 |
2016年 | 62篇 |
2015年 | 48篇 |
2014年 | 108篇 |
2013年 | 152篇 |
2012年 | 114篇 |
2011年 | 135篇 |
2010年 | 143篇 |
2009年 | 176篇 |
2008年 | 196篇 |
2007年 | 202篇 |
2006年 | 120篇 |
2005年 | 124篇 |
2004年 | 109篇 |
2003年 | 77篇 |
2002年 | 76篇 |
2001年 | 67篇 |
2000年 | 69篇 |
1999年 | 53篇 |
1998年 | 56篇 |
1997年 | 35篇 |
1996年 | 45篇 |
1995年 | 31篇 |
1994年 | 22篇 |
1993年 | 27篇 |
1992年 | 16篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2637条查询结果,搜索用时 15 毫秒
51.
In this paper, an improved Feature Extraction Method (FEM), which selects discriminative feature sets able to lead to high classification rates in pattern recognition tasks, is presented. The resulted features are the wavelet coefficients of an improved compressed signal, consisting of the Zernike moments amplitudes. By applying a straightforward methodology, it is aimed to construct optimal feature vectors in the sense of vector dimensionality and information content for classification purposes. The resulting surrogate feature vector is of lower dimensionality than the original Zernike moment feature vector and thus more appropriate for pattern recognition tasks.Appropriate validation tests have been arranged, in order to investigate the performance of the proposed algorithm by measuring the discriminative power of the new feature vectors despite the information loss. 相似文献
52.
We say a 0–1 matrix A avoids a matrix P if no submatrix of A can be transformed into P by changing some ones to zeroes. We call P an m-tuple permutation matrix if P can be obtained by replacing each column of a permutation matrix with m copies of that column. In this paper, we investigate n×n matrices that avoid P and the maximum number ex(n,P) of ones that they can have. We prove a linear bound on ex(n,P) for any 2-tuple permutation matrix P, resolving a conjecture of Keszegh [B. Keszegh, On linear forbidden matrices, J. Combin. Theory Ser. A 116 (1) (2009) 232–241]. Using this result, we obtain a linear bound on ex(n,P) for any m-tuple permutation matrix P. Additionally, we demonstrate the existence of infinitely many minimal non-linear patterns, resolving another conjecture of Keszegh from the same paper. 相似文献
53.
Robert Willenbring 《Discrete Applied Mathematics》2009,157(7):1607-1614
We construct a permutation representation for RNA secondary structure. We also introduce some basic combinatorial statistics for RNA secondary structure and relate them to permutation statistics when appropriate. These statistics allow us to quantify some structural phenomena in RNA secondary structure. 相似文献
54.
We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger’s benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions. 相似文献
55.
Anurag Agarwal 《Annals of Operations Research》2009,168(1):101-117
The augmented-neural-network (AugNN) approach has been applied lately to some NP-Hard combinatorial problems, such as task
scheduling, open-shop scheduling and resource-constraint project scheduling. In this approach the problem of search in the
solution-space is transformed to a search in a weight-matrix space, much like in a neural-network approach. Some weight adjustment
strategies are then used to converge to a good set of weights for a locally optimal solution. While empirical results have
demonstrated the effectiveness of the AugNN approach vis-à-vis a few other metaheuristics, little theoretical insights exist
which justify this approach and explain the effectiveness thereof. This paper provides some theoretical insights and justification
for the AugNN approach through some basic theorems and also describes the algorithm and the formulation with the help of examples. 相似文献
56.
In the open vehicle routing problem (OVRP), the objective is to minimise the number of vehicles and then minimise the total distance (or time) travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced by each vehicle must not exceed vehicle capacity. Additionally, in one variant of the problem, the travel time of each vehicle should not exceed an upper limit. 相似文献
57.
Knowledge based proximal support vector machines 总被引:1,自引:0,他引:1
We propose a proximal version of the knowledge based support vector machine formulation, termed as knowledge based proximal support vector machines (KBPSVMs) in the sequel, for binary data classification. The KBPSVM classifier incorporates prior knowledge in the form of multiple polyhedral sets, and determines two parallel planes that are kept as distant from each other as possible. The proposed algorithm is simple and fast as no quadratic programming solver needs to be employed. Effectively, only the solution of a structured system of linear equations is needed. 相似文献
58.
The fleet size and mix vehicle routing problem consists of defining the type, the number of vehicles of each type, as well as the order in which to serve the customers with each vehicle when a company has to distribute goods to a set of customers geographically spread, with the objective of minimizing the total costs. In this paper, a heuristic algorithm based on tabu search is proposed and tested on several benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature. 相似文献
59.
M. Zandieh M. Amiri B. Vahdani R. Soltani 《Journal of Computational and Applied Mathematics》2009,230(2):463-476
Most real world search and optimization problems naturally involve multiple responses. In this paper we investigate a multiple response problem within desirability function framework and try to determine values of input variables that achieve a target value for each response through three meta-heuristic algorithms such as genetic algorithm (GA), simulated annealing (SA) and tabu search (TS). Each algorithm has some parameters that need to be accurately calibrated to ensure the best performance. For this purpose, a robust calibration is applied to the parameters by means of Taguchi method. The computational results of these three algorithms are compared against each others. The superior performance of SA over TS and TS over GA is inferred from the obtained results in various situations. 相似文献
60.
A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling 总被引:1,自引:0,他引:1
We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as a solution combination method. Computational results on randomly generated problem sets are compared with the best available results indicating the efficiency of the proposed algorithm. 相似文献